Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms

نویسندگان

  • Eugene Edison
  • Tal Shima
چکیده

The problem of integrating task assignment and planning paths for a group of cooperating uninhabited aerial vehicles, servicing multiple targets, is addressed. In the problem of interest the uninhabited aerial vehicles need to perform multiple consecutive tasks cooperatively on each ground target. A Dubins car model is used for motion planning, taking into account each vehicle’s specific constraint of minimum turn radius. By using a finite set to define the visitation angle of a vehicle over a target we pose the integrated problem of task assignment and path optimization in the form of a graph. This new approach results in suboptimal trajectory assignments. Refining the visitation angle discretization allows for an improved solution. Due to the computational complexity of the resulting combinatorial optimization problem, we propose genetic algorithms for the stochastic search of the space of solutions. We distinguish between two cases of vehicle group composition: homogeneous, where all vehicles are identical; and heterogeneous, where the vehicles may have different operational capabilities and kinematic constraints. The performance of the genetic algorithms is demonstrated through sample runs and a Monte Carlo simulation study. Results show that the algorithms quickly provide good feasible solutions, and find the optimal solution for small sized problems. & 2010 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms

A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algorithm for solving such a problem is proposed. The algorithm allows us to efficiently solve this NP-hard problem that has prohibitive computational complexity for classical combinatorial optimization methods. It also allo...

متن کامل

Synchronous and Asynchronous Communication Effects on the Cooperative Control of Uninhabited Aerial Vehicles∗

Synchronous and asynchronous communication effects are considered in the cooperative control of uninhabited aerial vehicles where resource allocation is performed by an iterative network flow. We briefly outline both the single and iterative network flow assignment algorithms and their communication requirements. Then, using the abstracted communication framework found in the Air Force Research...

متن کامل

Assignment of Cooperating UAVs to Simultaneous Tasks using Genetic Algorithms

A problem of assigning multiple unmanned aerial vehicles (UAVs) to simultaneously perform cooperative tasks on consecutive targets is posed as a new NP-hard combinatorial optimization problem. The investigated scenario consists of multiple ground moving targets prosecuted by a team of heterogeneous UAVs carrying designated sensors and/or weapons. To successfully prosecute each target it first n...

متن کامل

Decentralized Task Assignment for Multiple UAVs using Genetic Algorithm with Negotiation scheme approach

This paper deals with a task assignment problem of cooperative multiple Unmanned Aerial Vehicles (UAVs). The problem about assigning the tasks to each UAV can be interpreted as a combinatorial optimization problem such as Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), and Generalized Assignment Problem (GAP). These problems have NP-complete computational complexity which has ...

متن کامل

Autonomous and cooperative robotic behavior based on fuzzy logic and genetic programming

Advances in a fuzzy decision theory that allow automatic cooperation between unmanned aerial vehicles (UAVs) are discussed. The algorithms determine points the UAVs are to sample, flight paths, and the optimal UAVs for the task and related changes during the mission. Human intervention is not required after the mission begins. The algorithms take into account what is known before and during the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2011